Entanglement of Embedded Graphs

Entanglement of embedded graphs

Undirected Graphs of Entanglement 3

Entanglement is a complexity measure of digraphs that origins in fixedpoint logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of entanglement at most k. Only partial results are known so far: digraphs for k = 1, and undirected graphs for k = 2. In this paper we investigate the structure of und...

Undirected Graphs of Entanglement Two

Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the problem of deciding whether a graph has entanglement at most k. As this measure is defined by means of games, game theoretic ideas naturally lead to design polynom...

Undirected Graphs of Entanglement 2

Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the problem of deciding whether a graph has entanglement at most k. As this measure is defined by means of games, game theoretic ideas naturally lead to design polynom...

Directed Graphs of Entanglement Two

Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal μ-calculus is strict. While graphs of entanglement zero and one are indeed very simple, some graphs of entanglement two already contain interesting nesting of cycles. This motivates our study of the class of graphs of entanglement two, as these are both simple in...